Recursive Baire Classification and Speedable Functions
نویسندگان
چکیده
Using recursive variants of Baire notions of nowhere dense and meagre sets we study the topological size of speedable and infinitely often speedable functions in a machine-independent framework. We show that the set of speedable functions is not "small" whereas the set of infinitely often speedable functions is "large". In this way we offer partial answers to a question in [4]. MSC: 03D15.
منابع مشابه
Relativized Topological Size of Sets of Partial Recursive Functions
Calude, C., Relativized topological size of sets of partial recursive functions (Note), Theoretical Computer Science 87 (1991) 347-352. In [ 11, a recursive topology on the set of unary partial recursive functions was introduced and recursive variants of Baire topological notions of nowhere dense and meagre sets were defined. These tools were used to measure the size of some classes of partial ...
متن کاملReal Recursive Functions and Baire Classes
Recursive functions over the reals [6] have been considered, first as a model of analog computation, and second to obtain analog characterizations of classical computational complexity classes [2]. However, one of the operators introduced in the seminal paper by Cris Moore (in 1996), the minimalization operator, creates some difficulties: (a) although differential recursion (the analog counterp...
متن کاملOn Some Properties of Baire-1 Functions
In this paper, we give alternative proofs of some of the properties of Baire-1 functions with respect to the new characterization of Baire-1 functions due to P.Y. Lee, W.K. Tang and D. Zhao. Some well-known functions were given to illustrate some of these properties. Mathematics Subject Classification: Primary 26A21
متن کاملTransfinite Sequences of Continuous and Baire 1 Functions on Separable Metric Spaces
We investigate the existence of well-ordered sequences of Baire 1 functions on separable metric spaces. Any set F of real valued functions defined on an arbitrary set X is partially ordered by the pointwise order, that is f ≤ g iff f(x) ≤ g(x) for all x ∈ X. In other words put f < g iff f(x) ≤ g(x) for all x ∈ X and f(x) 6= g(x) for at least one x ∈ X. Our aim will be to investigate the possibl...
متن کاملFunctions Whose Composition with Baire Class One Functions Are Baire Class One
We study the functions whose composition with Baire class one functions are Baire class one functions. We first prove some characterizations of such functions, then investigate a subclass of such functions which are defined in a natural way.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Log. Q.
دوره 38 شماره
صفحات -
تاریخ انتشار 1992